The integer point transform as a complete invariant

نویسندگان

چکیده

The integer point transform $\sigma_\PP$ is an important invariant of a rational polytope $\PP$, and here we show that it complete invariant. We prove only necessary to evaluate at one algebraic in order uniquely determine by employing the Lindemann-Weierstrass theorem. Similarly, Fourier $\PP$ single point, $\PP$. identical uniqueness results also hold for cones. In addition, relating finite transforms, number \emph{integer evaluations} suffice give equivalent condition central symmetry set, terms transform, some facts about its local maxima. Most are proven arbitrary sets points $\R^d$.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Tutorial of Integer Transform

The integer transform (such as the Walsh transform, the Haar transform) is a discrete transform that all the entries in the transform matrix are integers. For software and hardware, the integer transform is much easier to be implemented because there is no real number multiplication, but performance is not guaranteed. By contrast, the non-integer transform (such as the DCT, the DFT) has higher ...

متن کامل

The Complete Rank Transform: A Tool for Accurate and Morphologically Invariant Matching of Structures

Incorporating invariances is a popular tool to make computer vision systems more robust under real-world conditions. Since being invariant means ignoring something, every invariance has to come at the price of a loss of information. In our paper, we focus on severe illumination changes and descriptors that are invariant under such challenging conditions. The goal of our paper is to develop a no...

متن کامل

Transform coding with integer-to-integer transforms

A new interpretation of transform coding is developed that downplays quantization and emphasizes entropy coding, allowing a comparison of entropy coding methods with different memory requirements. With conventional transform coding, based on computing Karhunen–Loève transform coefficients and then quantizing them, vector entropy coding can be replaced by scalar entropy coding without an increas...

متن کامل

Integer fast Fourier transform

In this paper, a concept of integer fast Fourier transform (IntFFT) for approximating the discrete Fourier transform is introduced. Unlike the fixed-point fast Fourier transform (FxpFFT), the new transform has the properties that it is an integer-to-integer mapping, is power adaptable and is reversible. The lifting scheme is used to approximate complex multiplications appearing in the FFT latti...

متن کامل

Complete Integer Decision Procedures as Derived Rules in HOL

I describe the implementation of two complete decision procedures for integer Presburger arithmetic in the HOL theorem-proving system. The first procedure is Cooper’s algorithm, the second, the Omega Test. Between them, the algorithms illustrate three different implementation techniques in a fully expansive system.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Mathematics

سال: 2023

ISSN: ['2336-1298', '1804-1388']

DOI: https://doi.org/10.46298/cm.11218